package 剑指offer_leetcode;

/**
 * JZ10斐波那契数列
 */
public class 剑指Offer10_I_斐波那契数列 {
    public int fib(int n) {
        if(n<=1)
            return n;
        int[] dp = new int[n+1];
        dp[0] = 0;
        dp[1] = 1;
        for(int i=2;i<=n;i++)
            dp[i] = dp[i-1] % 1000000007  + dp[i-2] % 1000000007;
        return dp[n] % 1000000007;
    }
}
